Total time minimizing transportation problem
نویسندگان
چکیده
منابع مشابه
Total time minimization of fuzzy transportation problem
This paper proposes a procedure for solving total time minimization in fuzzy transportation problem where the transportation time, source and destination parameters have been expressed as exponential fuzzy numbers by the decision maker. An algorithm is developed to obtain the optimal solution as exponential fuzzy number, which enables the decision maker to obtain more informing results and wide...
متن کاملTime Minimizing Transportation Problem with Fractional Bottleneck Objective Function
This paper is aimed at studying the Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function (TMTP-FBOF). TMTP-FBOF is related to a Lexicographic Fractional Time Minimizing Transportation Problem (LFTMTP), which will be solved by a lexicographic primal code. An algorithm is also developed to determine an initial efficient basic solution to this TMTP-FBOF. The develop...
متن کاملPublic transport fleet scheduling for minimizing total transfer waiting time
Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables....
متن کاملA variant of time minimizing assignment problem
A time minimizing assignment problem (TMAP) dealing with the allocation ofn jobs to m(< n) persons is considered in this paper. One job is to be allocated to exactly one person and each person does at least one job. All the persons start working on the jobs simultaneously. If a person is to do more than one job, he does them one after the other in any order. The aim of the present study is to f...
متن کاملMinimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2007
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0701125n